Image reconstruction of fluorescent molecular tomography based on the tree structured Schur complement decomposition

نویسندگان

  • Wei Zou
  • Jiajun Wang
  • David Dagan Feng
چکیده

BACKGROUND The inverse problem of fluorescent molecular tomography (FMT) often involves complex large-scale matrix operations, which may lead to unacceptable computational errors and complexity. In this research, a tree structured Schur complement decomposition strategy is proposed to accelerate the reconstruction process and reduce the computational complexity. Additionally, an adaptive regularization scheme is developed to improve the ill-posedness of the inverse problem. METHODS The global system is decomposed level by level with the Schur complement system along two paths in the tree structure. The resultant subsystems are solved in combination with the biconjugate gradient method. The mesh for the inverse problem is generated incorporating the prior information. During the reconstruction, the regularization parameters are adaptive not only to the spatial variations but also to the variations of the objective function to tackle the ill-posed nature of the inverse problem. RESULTS Simulation results demonstrate that the strategy of the tree structured Schur complement decomposition obviously outperforms the previous methods, such as the conventional Conjugate-Gradient (CG) and the Schur CG methods, in both reconstruction accuracy and speed. As compared with the Tikhonov regularization method, the adaptive regularization scheme can significantly improve ill-posedness of the inverse problem. CONCLUSIONS The methods proposed in this paper can significantly improve the reconstructed image quality of FMT and accelerate the reconstruction process.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fast System Matrix Calculation in CT Iterative Reconstruction

Introduction: Iterative reconstruction techniques provide better image quality and have the potential for reconstructions with lower imaging dose than classical methods in computed tomography (CT). However, the computational speed is major concern for these iterative techniques. The system matrix calculation during the forward- and back projection is one of the most time- cons...

متن کامل

A Hierarchical Low-rank Schur Complement Preconditioner for Indefinite Linear Systems

Nonsymmetric and highly indefinite linear systems can be quite difficult to solve via iterative methods. This paper combines ideas from the Multilevel Schur Low-Rank preconditioner developed by Y. Xi, R. Li, and Y. Saad [SIAM J. Matrix Anal., 37 (2016), pp. 235–259] with classic block preconditioning strategies in order to handle this case. The method to be described generates a tree structure ...

متن کامل

Methods to evaluate the performance of kilovoltage cone-beam computed tomography in the three-dimensional reconstruction space

Background: Cone-beam computed tomography (CBCT) scanners for image-guided radiotherapy are in clinical use today, but there has been no consensus on uniform acceptance to verify the CBCT image quality yet. The present work proposed new methods to fully evaluate the performance of CBCT in its three-dimensional (3D) reconstruction space. Materials and Methods: Compared to the traditional methods...

متن کامل

A Study on Robustness of Various Deformable Image Registration Algorithms on Image Reconstruction Using 4DCT Thoracic Images

Background: Medical image interpolation is recently introduced as a helpful tool to obtain further information via initial available images taken by tomography systems. To do this, deformable image registration algorithms are mainly utilized to perform image interpolation using tomography images.Materials and Methods: In this work, 4DCT thoracic images of five real patients provided by DI...

متن کامل

DISCRETE TOMOGRAPHY AND FUZZY INTEGER PROGRAMMING

We study the problem of reconstructing binary images from four projections data in a fuzzy environment. Given the uncertainly projections,w e want to find a binary image that respects as best as possible these projections. We provide an iterative algorithm based on fuzzy integer programming and linear membership functions.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره 9  شماره 

صفحات  -

تاریخ انتشار 2010